A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
نویسندگان
چکیده
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repetitions. We present also experimental results showing that our method is efficient.
منابع مشابه
The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting
We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.
متن کاملReducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a deterministic simulation technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a deterministic simulation techniq...
متن کاملCommunication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram
In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where p processors, with O(~) ~> O(1) local memory each, communicate through some arbitrary interconnection network. They axe communication-efficient since they require, respectively, O...
متن کاملSecond Annual Workshop on Hardware Support for Objects and Microarchitectures for Java
.The Jamaica system combines a multithreaded single-chip multiprocessor with a dynamic thread distibution mechanism, to provide hardware support for fine-grained Java threads. This paper gives an overview of the threading mechanism, and investigates the granularity of parallelism which can be exploited in this way. Simulations demonstrate that the current system gives good performance with a wi...
متن کاملPerformance of Load Balancing Techniques for Join Operations in Shared-Noting Database Management Systems
We investigate various load balancing approaches for hash-based join techniques popular in multicomputer-based shared-nothing database systems. When the tuples are not uniformly distributed among the hash buckets, redistribution of these buckets among the processors is necessary to maintain good system performance. Two recent load balancing techniques rely on sampling and incremental balancing,...
متن کامل